Class number in a linear associative algebra

Discriminant Matrices of a Linear Associative Algebra

where ti(eres) and fa{erea) are the first and second traces, respectively, of eres. The first forms in terms of the constants of multiplication arise from the isomorphism between the first and second matrices of the elements of A and the elements themselves. The second forms result from direct calculation of the traces of R(er)R(es) and S(er)S(es), R{ei) and S(ei) denoting, respectively, the fi...

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

Secure Distributed Linear Algebra in a Constant Number of Rounds

Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols are available for generating random shared values, for secure multiplication and for addition of shared values. These requirements can be met by known techniques in all standard models of communication. In this model we co...

Making Non - Associative Algebra Associative Pei

Based on results about open string correlation functions, a nonassociative algebra was proposed in a recent paper for D-branes in a background with nonvanishing H. We show that our associative algebra obtained by quantizing the endpoints of an open string in an earlier work can also be used to reproduce the same correlation functions. The novelty of this algebra is that functions on the D-brane...

ON GENERALIZED INVERSES IN A LINEAR AsSOCIATIVE ALGEBRA AND THEIR APPLICATIONS